Date: Mon, 11 Nov 1996 17:02:42 GMT
Server: NCSA/1.5
Content-type: text/html
Last-modified: Wed, 11 Sep 1996 17:15:46 GMT
Content-length: 2894

<HTML>

<HEAD>
    <TITLE>CS302:  Tentative Syllabus</TITLE>
</HEAD>
<BODY BGCOLOR=#ffffff>

<CENTER>
<h2>This syllabus will quite certainly change. Check it often.</h2>
</CENTER>
<P>

<CENTER>
<TABLE BORDER=1>
    <TR>
	<TH ALIGN=LEFT>Week
	<TH ALIGN=LEFT>Topics
	<TH ALIGN=LEFT>Readings
    </TR>

    <TR>
	<TD>1
	<TD>intro to course, Computer Science, & C++; using the lab; <br> 
	    problem solving; computers; compiling; debugging & testing
	<TD>1.1-1.4
    </TR>

    <TR>
	<TD>2
	<TD>data objects; types; variables; expressions;<br>
	    simple i/o; conditionals; simple loops;
	<TD>2.1-2.4
    </TR>

    <TR>
	<TD>3
	<TD>style; functions introduced; program engineering;
	<TD>2.5, 3.1-3.3
    </TR>

    <TR>
	<TD>4
	<TD>procedural abstraction; scope: local variables;<br>
	    polymorphism: overloading; void functions 
	<TD>3.4-3.6, 4.1
    </TR>

    <TR>
	<TD>5
	<TD>reference & value parameters; more procedural abstraction<br>
	    more debugging & testing; streams & file i/o;
	<TD>4.2-4.4, 5.1
    </TR>

    <TR>
	<TD>6
	<TD>more streams; character i/o; inheritance
	<TD>5.2-5.4
    </TR>

    <TR>
	<TD>7
	<TD>Review; <br>
	    <B>EXAM #1</B>:  Everything above.<BR>
	    structures; classes: member functions, private vs. public
	<TD>6.1-6.2<BR>
	    supplemental
    </TR>

    <TR>
	<TD>8
	<TD>more classes; abstract data types; logical expressions; <BR>
	    nesting; switch statement    
	<TD>6.3, 7.1-7.2
    </TR>

    <TR>
	<TD>9
	<TD>more loops; Putting it All Together... (catch-up);<BR>
	<TD>7.3-7.4
    </TR>

    <TR>
	<TD>10
	<TD>designing ADTs; more classes;
	<TD>8.1-8.2
    </TR>

    <TR>
	<TD>11
	<TD>arrays:  using, defining, w/functions, w/classes 
	<TD>9.1-9.4
    </TR>

    <TR>
	<TD>12
	<TD>Review;<br>
	    <B>EXAM #2:</B>  everything above, emphasis on wks 7-11.<br>
            strings 
	<TD>10.1
    </TR>

    <TR>
	<TD>13
	<TD>strings; multi-dimensional arrays; string class
	<TD>10.2-10.3
    </TR>

    <TR>
	<TD>14
	<TD>pointers; dynamic memory; dynamic arrays; destructors<br>
	<TD>11.1-11.3
    </TR>

    <TR>
	<TD>15
	<TD>wrap-up;  review for final;  Extra fun-stuff...
	<TD>supplemental
    </TR>

    <TR>
	<TD>16
	<TD><B>EXAM #3</B>:  everything above, emphasis on wks 12-15.
	<TD>*
    </TR>
</TABLE>
</CENTER>

<P>
While reading you should always do the self-test exercises, and read
the summary sections.  <I>Always do the assigned reading before class</I>.
That is, you should read each week's assignment before the Tuesday of that
week.<P>    

<B>Exams will be
held on Tuesday or Wednesday eventings</B>.  
We will try to establish the place and time
roughly two weeks before the exam.<P>  <B>The final is on Tuesday Dec 17,
1996 at 5:50pm.</B>  Mark your calendar.<P>

<HR>
Last modified: Wed Sep 11 12:15:46 1996 by David Melski
<ADDRESS>
  <!WA0><!WA0><!WA0><A HREF="http://www.cs.wisc.edu/~melski/melski.html">melski@cs.wisc.edu</A>
</ADDRESS>

</BODY>

</HTML>
